Explicit theorems on generator polynomials
نویسنده
چکیده
Progress over the past decade is surveyed concerning explicit existence and construction theorems on irreducible, primitive and normal polynomials. © 2005 Elsevier Inc. All rights reserved.
منابع مشابه
The best uniform polynomial approximation of two classes of rational functions
In this paper we obtain the explicit form of the best uniform polynomial approximations out of Pn of two classes of rational functions using properties of Chebyshev polynomials. In this way we present some new theorems and lemmas. Some examples will be given to support the results.
متن کاملStructure theorems for AP rings
In “New Proofs of the structure theorems for Witt Rings”, the first author shows how the standard ring-theoretic results on the Witt ring can be deduced in a quick and elementary way from the fact that the Witt ring of a field is integral and from the specific nature of the explicit annihilating polynomials he provides. We will show in the present article that the same structure results hold fo...
متن کاملAPOSTOL TYPE (p, q)-FROBENIUS-EULER POLYNOMIALS AND NUMBERS
In the present paper, we introduce (p, q)-extension of Apostol type Frobenius-Euler polynomials and numbers and investigate some basic identities and properties for these polynomials and numbers, including addition theorems, difference equations, derivative properties, recurrence relations and so on. Then, we provide integral representations, explicit formulas and relations for these polynomial...
متن کاملCorrelation bounds for polynomials over {0, 1}1
This article is a unified treatment of the state-of-the-art on the fundamental challenge of exhibiting explicit functions that have small correlation with low-degree polynomials over {0, 1}. It discusses long-standing results and recent developments, related proof techniques, and connections with pseudorandom generators. It also suggests several research directions.
متن کاملSome conditions under which slow oscillation of a sequence of fuzzy numbers follows from Ces`{a}ro summability of its generator sequence
Let $(u_n)$ be a sequence of fuzzy numbers. We recover the slow oscillation of $(u_n)$ of fuzzy numbers from the Ces`{a}ro summability of its generator sequence and some additional conditions imposed on $(u_n)$. Further, fuzzy analogues of some well known classical Tauberian theorems for Ces`{a}ro summability method are established as particular cases.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Finite Fields and Their Applications
دوره 11 شماره
صفحات -
تاریخ انتشار 2005